// Copyright (c) 2010, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
//     * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

// ---
// Author: Jeffrey Junfeng Pan (panjunfeng@gmail.com)

#include "header.h"
#include "common/logging.h"
#include "common/testutil.h"

namespace {

class HeaderTest : public Test {
 protected:

  HeaderTest() {
  }

  virtual ~HeaderTest() {
  }
};

TEST_F(HeaderTest, GetAndSetValueInHeader) {
  frequent_pattern_mining::Header* header;
  header = new frequent_pattern_mining::Header;

  header->set_frequency(10, 123);
  CHECK_EQ(123, header->frequency(10));
  header->set_frequency(10, 456);
  CHECK_EQ(456, header->frequency(10));
  header->add_frequency(10, 10);
  CHECK_EQ(466, header->frequency(10));

  frequent_pattern_mining::Node* node;
  node = new frequent_pattern_mining::Node(1);
  header->add_node(node);
  CHECK_EQ(node, header->header_node(1));

  delete node;
  delete header;
}

}  // namespace

int main(int argc, char **argv) {
  return 0;
}
